Phase retrieval from incomplete data via weighted nuclear norm minimization
نویسندگان
چکیده
Recovering an unknown object from the magnitude of its Fourier transform is a phase retrieval problem. Here, we consider much difficult case, where those observed intensity values are incomplete and contaminated by both salt-and-pepper random-valued impulse noise. To take advantage low-rank property within image object, use regularization term which penalizes high weighted nuclear norm patch groups. For outliers (impulse noise) in observation, ?1?2 metric adopted as data fidelity term. Then break down resulting optimization problem into smaller ones, for example, proximal mapping minimization, because nonconvex nonsmooth subproblems have available closed-form solutions. The convergence results also presented, numerical experiments provided to demonstrate superior reconstruction quality proposed method.
منابع مشابه
Analyzing the Weighted Nuclear Norm Minimization and Nuclear Norm Minimization based on Group Sparse Representation
Nuclear norm minimization (NNM) tends to over-shrink the rank components and treats the different rank components equally, thus limits its capability and flexibility. Recent studies have shown that the weighted nuclear norm minimization (WNNM) is expected to be more accurate than NNM. However, it still lacks a plausible mathematical explanation why WNNM is more accurate than NNM. This paper ana...
متن کاملNuclear Norm Minimization via Active Subspace Selection
We describe a novel approach to optimizing matrix problems involving nuclear norm regularization and apply it to the matrix completion problem. We combine methods from non-smooth and smooth optimization. At each step we use the proximal gradient to select an active subspace. We then find a smooth, convex relaxation of the smaller subspace problems and solve these using second order methods. We ...
متن کاملOn Tensor Completion via Nuclear Norm Minimization
Many problems can be formulated as recovering a low-rank tensor. Although an increasingly common task, tensor recovery remains a challenging problem because of the delicacy associated with the decomposition of higher order tensors. To overcome these difficulties, existing approaches often proceed by unfolding tensors into matrices and then apply techniques for matrix completion. We show here th...
متن کاملOn the Optimal Solution of Weighted Nuclear Norm Minimization
In recent years, the nuclear norm minimization (NNM) problem has been attracting much attention in computer vision and machine learning. The NNM problem is capitalized on its convexity and it can be solved efficiently. The standard nuclear norm regularizes all singular values equally, which is however not flexible enough to fit real scenarios. Weighted nuclear norm minimization (WNNM) is a natu...
متن کاملOn the Convex Geometry of Weighted Nuclear Norm Minimization
Low-rank matrix approximation, which aims to construct a low-rank matrix from an observation, has received much attention recently. An efficient method to solve this problem is to convert the problem of rank minimization into a nuclear norm minimization problem. However, soft-thresholding of singular values leads to the elimination of important information about the sensed matrix. Weighted nucl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2022
ISSN: ['1873-5142', '0031-3203']
DOI: https://doi.org/10.1016/j.patcog.2022.108537